Complementation of Rational Sets on Countable Scattered Linear Orderings
نویسندگان
چکیده
In a preceding paper (Bruyère and Carton, automata on linear orderings, MFCS’01), automata have been introduced for words indexed by linear orderings. These automata are a generalization of automata for finite, infinite, bi-infinite and even transfinite words studied by Büchi. Kleene’s theorem has been generalized to these words. We prove that rational sets of words on countable scattered linear orderings are closed under complementation using an algebraic approach.
منابع مشابه
Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings
In this paper we consider languages of labelled N -free posets over countable and scattered linear orderings. We prove that a language of such posets is series-rational if and only if it is recognizable by a finite depth-nilpotent algebra if and only if it is bounded-width and monadic second-order definable. This extends previous results on languages of labelled N -free finite and ω-posets and ...
متن کاملComplementation of Rational Sets on Scattered Linear Orderings of Finite Rank
In a preceding paper [6], automata have been introduced for words indexed by linear orderings. These automata are a generalization of automata for finite, infinite, bi-infinite, and even transfinite words studied by Büchi. Kleene’s theorem has been generalized to these words. We show that deterministic automata do not have the same expressive power. Despite this negative result, we prove that r...
متن کاملAutomata on Linear Orderings
We consider words indexed by linear orderings. These extend finite, (bi-)infinite words and words on ordinals. We introduce finite automata and rational expressions for these words. We prove that for countable scattered linear orderings, these two notions are equivalent. This result extends Kleene’s theorem.
متن کاملFactorisation forests for infinite words Application to countable scattered linear orderings
The theorem of factorisation forests shows the existence of nested factorisations — a la Ramsey — for finite words. This theorem has important applications in semigroup theory, and beyond. We provide two improvements to the standard result. First we improve on all previously known bounds for the standard theorem. Second, we extend it to every ‘complete linear ordering’. We use this variant in a...
متن کاملTree Automata and Automata on Linear Orderings
We show that the inclusion problem is decidable for rational languages of words indexed by scattered countable linear orderings. The method leans on a reduction to the decidability of the monadic second order theory of the infinite binary tree [9]. Mathematics Subject Classification. 68Q45, 03D05.
متن کامل